Tree-average distances on certain phylogenetic networks have their weights uniquely determined
نویسندگان
چکیده
منابع مشابه
Reconstruction of certain phylogenetic networks from their tree-average distances.
Trees are commonly utilized to describe the evolutionary history of a collection of biological species, in which case the trees are called phylogenetic trees. Often these are reconstructed from data by making use of distances between extant species corresponding to the leaves of the tree. Because of increased recognition of the possibility of hybridization events, more attention is being given ...
متن کاملUnique solvability of certain hybrid networks from their distances
Phylogenetic relationships among taxa have usually been represented by rooted trees in which the leaves correspond to extant taxa and interior vertices correspond to extinct ancestral taxa. Recently, more general graphs than trees have been investigated in order to be able to represent hybridization, lateral gene transfer, and recombination events. A model is presented in which the genome at a ...
متن کاملAverage Distances of Pyramid Networks
For an interconnection network, calculating average distance of it is in general more difficult than determining its diameter. Diameters of pyramid networks are well known. This study calculates average distances of pyramid networks.
متن کاملOn Tree-Based Phylogenetic Networks
A large class of phylogenetic networks can be obtained from trees by the addition of horizontal edges between the tree edges. These networks are called tree-based networks. We present a simple necessary and sufficient condition for tree-based networks and prove that a universal tree-based network exists for any number of taxa that contains as its base every phylogenetic tree on the same set of ...
متن کاملOn uniquely k-determined permutations
Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria for a permutation to be uniquely k-determined: one in terms of the distance between two consecutive elements in a permutation, and the other one in terms of directed hamiltonian paths in the certain graphs called path-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2012
ISSN: 1748-7188
DOI: 10.1186/1748-7188-7-13